An adapted water wave optimization algorithm for routing order pickers in manual warehouses
نویسندگان
چکیده
In this paper, we present a new algorithm for routing order pickers in manual warehouses and optimizing the total distance covered. The proposed approach is an adaptation of the recent water wave optimization (WWO) algorithm, a nature-inspired algorithm based on the shallow water wave theory. The algorithm is tested on a rectangular 1-block warehouse, with 12 aisles and 45 storage locations per aisle side (1080 storage locations overall). The depot is located at the bottom left corner of the warehouse. A Microsoft ExcelTM file was programmed to reproduce both the adapted WWO algorithm and to test its performance, in terms of the travel distance covered by pickers. A formal design of experiment (DOE) analysis is carried out on some of the algorithm parameters, to assess their effect on the performance observed (namely computational time and number of iterations required to reach convergence) and identify the optimal setting.
منابع مشابه
Data-driven warehouse optimization: deploying skills of order pickers
Batching orders and routing order pickers is a commonly studied problem in many picker-to-parts warehouses. The impact of individual differences in picking skills on performance has received little attention. In this paper, we show that taking into account differences in the skills of individual pickers when assigning work has a substantial effect on total batch execution time and picker produc...
متن کاملTowards a Metaheuristic for Routing Order Pickers in a Warehouse
In this paper we will deal with the sequencing and routing problem of order pickers in conventional multi-parallel-aisle warehouse systems. For this NP-hard Steiner Travelling Salesman Problem exact algorithms only exist for warehouses with at most three cross aisles. We propose a new approach were the problem of routing order pickers in multiple-block warehouses is translated into a classical ...
متن کاملRouting order pickers in a warehouse with a middle aisle
This paper considers a parallel aisle warehouse, where order pickers can change aisles at the ends of every aisle and also at a cross aisle halfway along the aisles. An algorithm is presented that can find shortest order picking tours in this type of warehouses. The algorithm is applicable in warehouse situations with up to three aisle changing possibilities. Average tour length is compared for...
متن کاملA U-shaped layout for manual order-picking systems
In manual order picking systems, order pickers walk or ride through a warehouse in order to collect items requested by customers. The performance of such a system is significantly dependent on its layout which determines the lengths of the order pickers’ tours and the corresponding picking times. Whereas for classic warehouse layouts all picking aisles are arranged in parallel to each other, in...
متن کاملA Solution Approach for the Joint Order Batching and Picker Routing Problem in a Two-Block Layout
Order Batching and Picker Routing Problems arise in warehouses when articles have to be retrieved from their storage location in order to satisfy a given demand specified by customer orders. The Order Batching Problem includes the grouping of a given set of customer orders into feasible picking orders such that the total length of all picker tours is minimized. The problem of determining the se...
متن کامل